Tight Bound on Mobile Byzantine Agreement
نویسندگان
چکیده
Article history: Received 12 March 2015 Received in revised form 6 October 2015 Accepted 14 October 2015 Available online 20 October 2015 Communicated by D. Peleg
منابع مشابه
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems
In this paper, we show that the protocol complex of a Byzantine synchronous system can remain (k− 1)-connected for up to ⌈t/k⌉ rounds, where t is the maximum number of Byzantine processes, and t ≥ k ≥ 1. Protocol complex connectivity is important since a (k − 1)-connected protocol complex does not admit solutions for the k-set agreement problem. In crash-failure systems, the connectivity upper ...
متن کاملRelaxed Byzantine Vector Consensus
Byzantine vector consensus requires that non-faulty processes reach agreement on a decision (or output) that is in the convex hull of the inputs at the non-faulty processes. Recent work has shown that, for n processes with up to f Byzantine failures, when the inputs are d-dimensional vectors of reals, n ≥ max (3f + 1, (d+ 1)f + 1) is the tight bound for synchronous systems, and n ≥ (d+ 2)f + 1 ...
متن کاملCapacity of Byzantine Agreement: Tight Bound for the Four Node Network
In this report, we consider the problem of maximizing the throughput of Byzantine agreement. Byzantine agreement is a classical problem in distributed computing, with initial solutions presented in the seminal work of Pease, Shostak and Lamport [1, 2]. There has also been more recent work on designing multicast algorithms that can survive Byzantine attacks (e.g., [3]). Many variations on the By...
متن کاملA Necessary Condition for Byzantine $k$-Set Agreement
This short paper presents a necessary condition for Byzantine k-set agreement in (synchronous or asynchronous) message-passing systems and asynchronous shared memory systems where the processes communicate through atomic single-writer multi-reader registers. It gives a proof, which is particularly simple, that k-set agreement cannot be solved t-resiliently in an n-process system when n ≤ 2t + t...
متن کاملImproved Connectivity Condition for Byzantine Fault Tolerance
Given a network in which some pairs of nodes can communicate freely, and some subsets of the nodes could be faulty and colluding to disrupt communication, when can messages reliably be sent from one given node to another? We give a new characterization of when the agreement problem can be solved and provide an agreement algorithm which can reach agreement when the number of Byzantine nodes alon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 609 شماره
صفحات -
تاریخ انتشار 2014